منابع مشابه
Non-Euclidean visibility problems
Consider in R2 the standard lattice L = Z×Z and the origin (0,0). A point (m,n) ∈ L−{(0,0)} is said to be visible if the segment connecting the origin and (m,n) does not contain any other lattice points. Visibility problems have been studied since a century. Perhaps the most celebrated problems are the visible version of Gauss circle problem and the so-called orchard problem (see other problems...
متن کاملEuclidean Pawel Winter 187 trees visibility
The notion of Steiner visibility graphs is introduced. Their applicability in connection with the construction of good quality suboptimal solutions to the Euclidean Steiner tree problem with obstacles is discussed. Polynomial algorithms generating Steiner visibility graphs are described.
متن کاملThe non-Euclidean Euclidean algorithm
In this paper we demonstrate how the geometrically motivated algorithm to determine whether a twogenerator real Möbius group acting on the Poincaré plane is or is not discrete can be interpreted as a non-Euclidean Euclidean algorithm. That is, the algorithm can be viewed as an application of the Euclidean division algorithm to real numbers that represent hyperbolic distances. In the case that t...
متن کاملHuman Performance on Hard Non-Euclidean Graph Problems: Vertex Cover
Recent studies on a computationally hard visual optimization problem, the Traveling Salesperson Problem (TSP), indicate that humans are capable of finding close to optimal solutions in near-linear time. The current study is a preliminary step in investigating human performance on another hard problem, the Minimum Vertex Cover Problem, in which solvers attempt to find a smallest set of vertices ...
متن کاملExplicit Ramsey Graphs and Erdös Distance Problems over Finite Euclidean and Non-Euclidean Spaces
We study the Erdős distance problem over finite Euclidean and non-Euclidean spaces. Our main tools are graphs associated to finite Euclidean and non-Euclidean spaces that are considered in Bannai-Shimabukuro-Tanaka (2004, 2007). These graphs are shown to be asymptotically Ramanujan graphs. The advantage of using these graphs is twofold. First, we can derive new lower bounds on the Erdős distanc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Indian Academy of Sciences - Section A
سال: 2006
ISSN: 0370-0089
DOI: 10.1007/bf02829784